Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
831	A Survey of Automated Timetabling A. Schaerf Dipartimento di Informatica e Sistemistica Universit` a di Roma “La Sapienza” Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:16 Mathematical optimization Operations research Search algorithms Complexity classes Combinatorial optimization Genetic algorithm Optimization problem Constraint satisfaction NP-complete Theoretical computer science Applied mathematics Computational complexity theory
832	Multiparty Key Agreement using Bilinear Map Nam-Su Jho, Myung-Hwan Kim, Do Won Hong and Byung-Gil Lee ABSTRACT ⎯ A key agreement protocol is a cryptographical primitive which allows participants to share a common secre Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-12-17 20:17:06 Computer science Advantage Polynomial Time complexity Low Algorithm Applied mathematics Computational complexity theory Mathematics
833	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 27 May 2010 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2011-04-04 11:42:17 Analysis of algorithms Algorithm Mathematical logic Time complexity Regular expression P Randomized algorithm Median graph Theoretical computer science Computational complexity theory Applied mathematics
834	— A merged version of this work and the work of [DJKL12] appears in the proceedings of the Theory of Cryptography Conference - TCC 2013 — Why “Fiat-Shamir for Proofs” Lacks a Proof Nir Bitansky∗ Tel Aviv Univer Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-19 16:42:35 Search algorithms Computational complexity theory Random oracle Interactive proof system Hash function Zero-knowledge proof Universal hashing Collision resistance Hash list Cryptography Cryptographic hash functions Hashing
835	Unprovable Security of Two-Message Zero Knowledge Kai-Min Chung∗ Edward Lui∗ Mohammad Mahmoody∗ Rafael Pass∗ December 19, 2012 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-19 11:29:49 Complexity classes Cryptographic protocols Probabilistic complexity theory Interactive proof system Probabilistically checkable proof IP Soundness Zero-knowledge proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
836	Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:43 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics
837	Precise Concurrent Zero Knowledge Omkant Pandey∗ Rafael Pass† Amit Sahai∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-02-01 05:01:22 Cryptographic protocols Zero-knowledge proof IP NP Commitment scheme Randomized algorithm Alice and Bob Interactive proof system Proof of knowledge Theoretical computer science Computational complexity theory Cryptography
838	Armadillo: a compilation chain for privacy preserving applications Sergiu Carpov, Paul Dubrulle, Renaud Sirdey CEA, LIST, Embedded Real Time & Security Laboratory, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-10 03:12:34 Mathematics Logic in computer science Homomorphic encryption Computational complexity theory Boolean circuit Block cipher modes of operation Advanced Encryption Standard Circuit Block cipher Theoretical computer science Cryptography Applied mathematics
839	A Course in Machine Learning Hal Daumé III 10 \| L EARNING T HEORY Add to Reading List Source URL: ciml.info Language: English - Date: 2014-09-24 16:08:31 Computational learning theory Machine learning Models of computation Computational complexity theory Probably approximately correct learning Algorithm Decision tree model VC dimension PP Theoretical computer science Applied mathematics Mathematics
840	Hardness Preserving Reductions via Cuckoo Hashing Itay Berman∗ Iftach Haitner∗ Ilan Komargodski† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-24 16:10:17 Pseudorandomness Search algorithms Hashing Computational complexity theory Pseudorandom function family Pseudorandom generator Hash function Cuckoo hashing One-way function Cryptography Theoretical computer science Mathematics

UPDATE